A Variant of the Gröbner Basis Algorithm for Computing Hilbert Bases
نویسندگان
چکیده
Gröbner bases can be used for computing the Hilbert basis of a numerical submonoid. By using these techniques, we provide an algorithm that calculates a basis of a subspace of a finite-dimensional vector space over a finite prime field given as a matrix kernel. AMS Subject Classification: 13P10, 94B05
منابع مشابه
F5C: A variant of Faugère's F5 algorithm with reduced Gröbner bases
Faugère's F5 algorithm computes a Gröbner basis incrementally, by computing a sequence of (non-reduced) Gröbner bases. The authors describe a variant of F5, called F5C, that replaces each intermediate Gröbner basis with its reduced Gröbner basis. As a result, F5C considers fewer polynomials and performs substantially fewer polynomial reductions, so that it terminates more quickly. We also provi...
متن کاملComputing difference-differential dimension polynomials by relative Gröbner bases in difference-differential modules
In this paper we present a new algorithmic approach for computing the Hilbert function of a finitely generated difference-differential module equipped with the natural double filtration. The approach is based on a method of special Gröbner bases with respect to “generalized term orders” on Nm × Zn and on difference-differential modules. We define a special type of reduction for two generalized ...
متن کاملComputation of Hilbert Schemes
Hilbert schemes are a basic topic in Algebraic Geometry [1, 2]. Methods related to Gröbner bases are fundamental here, as Hartshorne’s proof of the connectedness of Hilbert schemes via generic initial ideals demonstrates [3]. For many purposes, the explicit construction of Hilbert schemes is important. Classical approaches lead to prohibitively large equations. Newer ideas like Gröbner strata [...
متن کاملOn Border Basis and Gröbner Basis Schemes
Hilbert schemes of zero-dimensional ideals in a polynomial ring can be covered with suitable affine open subschemes whose construction is achieved using border bases. Moreover, border bases have proved to be an excellent tool for describing zero-dimensional ideals when the coefficients are inexact. And in this situation they show a clear advantage with respect to Gröbner bases which, neverthele...
متن کاملGröbner Bases of Bihomogeneous Ideals generated by Polynomials of Bidegree (1,1): Algorithms and Complexity
Solving multihomogeneous systems, as a wide range of structured algebraic systems occurring frequently in practical problems, is of first importance. Experimentally, solving these systems with Gröbner bases algorithms seems to be easier than solving homogeneous systems of the same degree. Nevertheless, the reasons of this behaviour are not clear. In this paper, we focus on bilinear systems (i.e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1303.6296 شماره
صفحات -
تاریخ انتشار 2013